Introduce FiberMultiLock#83
Merged
Merged
Conversation
A keyed, fiber-aware lock over a uint64_t key space: the same key gives mutual exclusion, distinct keys proceed independently, and contenders for a held key are granted it in FIFO order. Non-reentrant. Allocation-free like FiberCondVar - each acquisition's wait state lives in the caller's ScopedLock on the stack, so lock cannot fail and returns void. A SpinLock guards a Tree<WaitEntry> keyed by key; unlock promotes the front waiter and swaps it into the tree, preserving arrival order across handoffs.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
A keyed, fiber-aware lock over a uint64_t key space: the same key gives mutual exclusion, distinct keys proceed independently, and contenders for a held key are granted it in FIFO order. Non-reentrant.
Allocation-free like FiberCondVar - each acquisition's wait state lives in the caller's ScopedLock on the stack, so lock cannot fail and returns void. A SpinLock guards a Tree keyed by key; unlock promotes the front waiter and swaps it into the tree, preserving arrival order across handoffs.